An analysis of constant modulus receivers

نویسندگان

  • Hanks H. Zeng
  • Lang Tong
  • C. Richard Johnson
چکیده

This paper investigates connections between (nonblind) Wiener receivers and blind receivers designed by minimizing the constant modulus (CM) cost. Applicable to both T-spaced and fractionally spaced FIR equalization, the main results include 1) a test for the existence of CM local minima near Wiener receivers; 2) an analytical description of CM receivers in the neighborhood of Wiener receivers; 3) mean square error (MSE) bounds for CM receivers. When the channel matrix is invertible, we also show that the CM receiver is approximately colinear with the Wiener receiver and provide a quantitative measure of the size of neighborhoods that contain the CM receivers and the accuracy of the MSE bounds.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Geometrical characterizations of constant modulus receivers

Convergence properties of the constant modulus (CM) and the Shalvi–Weinstein (SW) algorithms in the presence of noise remain largely unknown. A new geometrical approach to the analysis of constant modulus and Shalvi–Weinstein receivers is proposed by considering a special constrained optimization involving norms of the combined channel-receiver response. This approach provides a unified framewo...

متن کامل

The MSE performance of constant modulus receivers

The constant modulus algorithm (CMA) is an e ective technique for blind receiver design in practice. Treating CMA as a linear estimation problem, e ects of noise and channel conditions are investigated. For the class of channels with arbitary nite impulse responses, an analytical description of locations of constant modulus receivers and an upper bound of their mean squared errors (MSE) are der...

متن کامل

An analysis of constant modulus algorithm for array signal processing

The constant modulus (CM) cost function is analyzed for array signal processing. The analysis includes arbitrary source types. It is shown that CM receivers have the signal space property except in two special cases. Local minima of CM cost function are completely characterized for the noiseless case. In the presence of measurement noise, the existence of CM local minima in the neighborhood of ...

متن کامل

Convergence behaviours of an adaptive step-size constant modulus algorithm for DS-CDMA receivers

A convergence analysis of the blind adaptive step-size constant modulus algorithm (AS-CMA) for direct-sequence code division multiple access (DS-CDMA) receivers is presented. Analytical results show similar convergence behaviours of the AS-CMA receiver and the adaptive step-size stochastic approximation (ASSA) receiver. Simulations show that the blind AS-CMA algorithm performs comparably with t...

متن کامل

Relationships Between the Constant Modulus and Wiener Receivers

The Godard or the constant modulus algorithm (CMA) is an effective technique for blind receiver design in communications. However, due to the complexity of the Constant Modulus (CM) cost function, the performance of CM receivers has primarily been evaluated using simulations. Theoretical analysis is typically based on either the noiseless case or approximations of the cost function. The followi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Signal Processing

دوره 47  شماره 

صفحات  -

تاریخ انتشار 1999